Boolean Formalism and Explanations

نویسنده

  • Eric C. R. Hehner
چکیده

Boolean algebra is simpler than number algebra, with applications in programming, circuit design, law, specifications, mathematical proof, and reasoning in any domain. So why is number algebra taught in primary school and used routinely by scientists, engineers, economists, and the general public, while boolean algebra is not taught until university, and not routinely used by anyone? A large part of the answer may be in the terminology of logic, in the symbols used, and in the explanations of boolean algebra found in textbooks. The subject has not yet freed itself from its history and philosophy. This paper points out the problems delaying the acceptance and use of boolean algebra, and suggests some solutions.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modelling mechanisms with causal cycles

Mechanistic philosophy of science views a large part of scientific activity as engaged in modelling mechanisms. While science textbooks tend to offer qualitative models of mechanisms, there is increasing demand for models from which one can draw quantitative predictions and explanations. Casini et al. (2011) put forward the Recursive Bayesian Net (RBN) formalism as well suited to this end. The ...

متن کامل

Sémantique fonctionnelle pour les QBF non prénexes

We propose in this article a functional semantics for non-prenex Quantified Boolean Formulae. The proposed formalism is symetrical for validity and non-validity and allows to give different interpretations to the quantifiers. This formalism is also sufficiently flexible to allow the definition of a certificate for the search-based algorithms

متن کامل

sbp: A Scannerless Boolean Parser

Scannerless generalized parsing techniques allow parsers to be derived directly from unified, declarative specifications. Unfortunately, in order to uniquely parse (disambiguate) existing programming languages, extensions beyond the usual contextfree formalism must be added to handle a number of specific cases. This paper describes sbp, a scannerless parser for boolean grammars, a superset of c...

متن کامل

An Easy Road to Nominalism

In this paper, I provide an easy road to nominalism which does not rely on a Field-type nominalization strategy for mathematics (Field 1980). According to this proposal, applications of mathematics to science, and alleged mathematical explanations of physical phenomena, only emerge when suitable physical interpretations of the mathematical formalism are advanced. And since these interpretations...

متن کامل

History of neuro - linguistic programming

To begin to take steps to a mental ecology of emergence we first establish twofundamental assumptions from the methodology of transformational grammar—thecentrality of human judgment based on direct experience and the proposition that thesystematic nature of human behavior is algorithmically driven. We then set a doublecriterion for understanding any formalism such as emergence:...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996